The k -Resource Problem on Uniform and on Uniformly Decomposable Metric Spaces
نویسندگان
چکیده
We define a natural generalization of the prominent k-server problem, the k-resource problem. It occurs in metric spaces with some demands and resources given at its points. The demands may vary with time, but the total demand may never exceed k. The goal of an online algorithm is to satisfy demands by moving resources, while minimizing the cost for transporting resources. We give an asymptotically optimal O(log(min{n, k}))-competitive randomized algorithm and an O(min{k, n})-competitive deterministic one for the k-resource problem on uniform metric spaces consisting of n points. This extends known results for paging to the more general setting of k-resource. Basing on the results for uniform metric spaces, we develop a randomized algorithm solving the k-resource and the k-server problem on metric spaces which can be decomposed into components far away from each other. The algorithm achieves a competitive ratio of O(log(min{n, k})), provided that it has some extra resources more than the optimal algorithm.
منابع مشابه
On Best Proximity Points in metric and Banach spaces
Notice that best proximity point results have been studied to find necessaryconditions such that the minimization problemminx∈A∪Bd(x,Tx)has at least one solution, where T is a cyclic mapping defined on A∪B.A point p ∈ A∪B is a best proximity point for T if and only if thatis a solution of the minimization problem (2.1). Let (A,B) be a nonemptypair in a normed...
متن کاملFixed points for total asymptotically nonexpansive mappings in a new version of bead space
The notion of a bead metric space is defined as a nice generalization of the uniformly convex normed space such as $CAT(0)$ space, where the curvature is bounded from above by zero. In fact, the bead spaces themselves can be considered in particular as natural extensions of convex sets in uniformly convex spaces and normed bead spaces are identical with uniformly convex spaces. In this paper, w...
متن کاملUniform connectedness and uniform local connectedness for lattice-valued uniform convergence spaces
We apply Preuss' concept of $mbbe$-connectedness to the categories of lattice-valued uniform convergence spaces and of lattice-valued uniform spaces. A space is uniformly $mbbe$-connected if the only uniformly continuous mappings from the space to a space in the class $mbbe$ are the constant mappings. We develop the basic theory for $mbbe$-connected sets, including the product theorem. Furtherm...
متن کاملRandomized algorithm for the k-server problem on decomposable spaces
We study the randomized k-server problem on metric spaces consisting of widely separated subspaces. We give a method which extends existing algorithms to larger spaces with the growth rate of the competitive quotients being at most O(log k). This method yields o(k)-competitive algorithms solving the randomized k-server problem, for some special underlying metric spaces, e.g. HSTs of"small"heigh...
متن کاملFixed Point Theorems on Complete Quasi Metric Spaces Via C-class and A-Class Functions
In this paper, we present some fixed point theorems for single valued mappings on $K$-complete, $M$-complete and Symth complete quasi metric spaces. Here, for contractive condition, we consider some altering distance functions together with functions belonging to $C$-class and $A$-class. At the same time, we will consider two different type $M$ functions in contractive conditions because the qu...
متن کامل